A Probabilistic Numerical Method for Fully Nonlinear

We consider the probabilistic numerical scheme for fully nonlinear partial differential equations suggested in [Comm. Pure Appl. Math. 60 (2007) 1081–1110] and show that it can be introduced naturally as a combination of Monte Carlo and finite difference schemes without appealing to the theory of backward stochastic differential equations. Our first main result provides the convergence of the discrete-time approximation and derives a bound on the discretization error in terms of the time step. An explicit implementable scheme requires the approximation of the conditional expectation operators involved in the discretization. This induces a further Monte Carlo error. Our second main result is to prove the convergence of the latter approximation scheme and to derive an upper bound on the approximation error. Numerical experiments are performed for the approximation of the solution of the mean curvature flow equation in dimensions two and three, and for twoand fivedimensional (plus time) fully nonlinear Hamilton–Jacobi–Bellman equations arising in the theory of portfolio optimization in financial mathematics.